Superdevelopments for Weak Reduction
نویسندگان
چکیده
We study superdevelopments in the weak lambda calculus of Çaǧman and Hindley, a confluent variant of the standard weak lambda calculus in which reduction below lambdas is forbidden. In contrast to developments, a superdevelopment from a term M allows not only residuals of redexes in M to be reduced but also some newly created ones. In the lambda calculus there are three ways new redexes may be created; in the weak lambda calculus a new form of redex creation is possible. We present labeled and simultaneous reduction formulations of superdevelopments for the weak lambda calculus and prove them equivalent.
منابع مشابه
From Abstract Strategies to Strategic Rewriting
Strategies are ubiquitous in automated deduction and reasoning systems, yet only since about ten years have they been studied in their own right. In the two communities of automated deduction and rewriting, workshops have been launched to make progress towards a deeper understanding of the nature of strategies, their descriptions, their properties, and their usage. Recently strategies have come...
متن کاملNormalization of Typable Terms by Superdevelopments
We define a class of hyperbalanced λ-terms by imposing syntactic constraints on the construction of λ-terms, and show that such terms are strongly normalizing. Furthermore, we show that for any hyperbalanced term, the total number of superdevelopments needed to compute its normal form can be statically determined at the beginning of reduction. To obtain the latter result, we develop an algorith...
متن کاملMatching Modulo Superdevelopments Application to Second-Order Matching
To perform higher-order matching, we need to decide the βη-equivalence on λ-terms. The first way to do it is to use simply typed λ-calculus and this is the usual framework where higher-order matching is performed. Another approach consists in deciding a restricted equivalence based on finite superdevelopments. We consider higher-order matching modulo this equivalence over untyped λ-terms for wh...
متن کاملHigher - Order Matching modulo ( Super ) Developments 1 Applications to Second - Order Matching
To perform higher-order matching, we need to decide the βη-equivalence on λ-terms. The first way to do it is to use simply typed λ-calculus and this is the usual framework where higher-order matching is performed. Another approach consists in deciding a restricted equivalence. This restricted equivalence can be based on finite developments or more interestingly on finite superdevelopments. We c...
متن کاملSmaran: A Congruence-Closure Based System for Equational Computations
p. 1 Redundancy Criteria for Constrained Completion p. 2 Bi-rewriting, a Term Rewriting Technique for Monotonic Order Relations p. 17 A Case Study of Completion Modulo Distributivity and Abelian Groups p. 32 A Semantic Approach to Order-Sorted Rewriting p. 47 Distributing Equational Theorem Proving p. 62 On the Correctness of a Distributed Memory Grobner Basis Algorithm p. 77 Improving Transfor...
متن کامل